A note on the computation of the largest p LCEs of discrete dynamical systems
نویسندگان
چکیده
Two ecient and numerically stable methods for the computation of the largest p Lyapunov characteristic exponents of an n dimensional discrete dynamical systems are presented. The eciencies of the proposed methods are compared with the eciencies of other methods through an operation count, and illustrated with an example. Ó 2000 Elsevier Science Inc. All rights reserved.
منابع مشابه
The Lyapunov Characteristic Exponents and their computation
We present a survey of the theory of the Lyapunov Characteristic Exponents (LCEs) for dynamical systems, as well as of the numerical techniques developed for the computation of the maximal, of few and of all of them. After some historical notes on the first attempts for the numerical evaluation of LCEs, we discuss in detail the multiplicative ergodic theorem of Oseledec [102], which provides th...
متن کاملOn the Notion of Fuzzy Shadowing Property
This paper is concerned with the study of fuzzy dynamical systems. Let (XM ) be a fuzzy metric space in the sense of George and Veeramani. A fuzzy discrete dynamical system is given by any fuzzy continuous self-map dened on X. We introduce the various fuzzy shad- owing and fuzzy topological transitivity on a fuzzy discrete dynamical systems. Some relations between this notions have been proved.
متن کاملOn the shadowing property of nonautonomous discrete systems
In this paper we study shadowing property for sequences of mappings on compact metric spaces, i.e. nonautonomous discrete dynamical systems. We investigate the relation of weak contractions with shadowing and h-shadowing property.
متن کاملThe Study of Nonlinear Dynamical Systems Nuclear Fission Using Hurwitz Criterion
In this paper, the nonlinear dynamic system of equations, a type of nuclear ssion reactor is solved analytically and numerically. Considering that the direct solution of three-dimensional dynamical systems analysis and more in order to determine the stability and instability, in terms of algebraicsystems is dicult. Using certain situations in mathematics called Hurwitz criterion, Necessary and ...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 114 شماره
صفحات -
تاریخ انتشار 2000